منابع مشابه
On the Special Properties of Graphic and Co-graphic Bondgraphs
The special combinatorial properties of graphic and co-graphic bondgraphs are analysed. A graphic bondgraph is one which has an associated graph, meaning that the two represent the same combinatorial information, expressed in thej’unctions of the bondgraph or the cycles of the graph. Dually a co-graphic bondgraph is one whose dual bondgraph has an associated graph. The combinatorial basis for c...
متن کاملGraphic Matroids
Matroid theory was first formalized in 1935 by Whitney [5] who introduced the notion as an attempt to study the properties of vector spaces in an abstract manner. Since then, matroids have proven to have numerous applications in a wide variety of fields including combinatorics and graph theory. Today we will briefly survey matroid representation and then discuss some problems in matroid optimiz...
متن کاملGraphic Waveshaping
In the design of recent systems, I have advanced techniques that position graphic synthesis methods in the context of solo, improvisational performance. Here, the primary interfaces for musical action are prepared works on paper, scanned by digital video cameras which in turn pass image data on to software for analysis and interpretation as sound synthesis and signal processing procedures. The ...
متن کاملGraphic design
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devices. Complete configurations are built by connecting elements into a graph; packets flow along the ...
متن کاملPacking of Graphic Sequences
Let π1 and π2 be graphic n-tuples, with π1 = (d (1) 1 , . . . , d (1) n ) and π2 = (d (2) 1 , . . . , d (2) n ) (they need not be monotone). We say that π1 and π2 pack if there exist edge-disjoint graphs G1 and G2 with vertex set {v1, . . . , vn} such that the degrees of vi in G1 and G2 are d (1) i and d (2) i , respectively. We prove that two graphic n-tuples pack if ∆ ≤ √ 2δn− (δ−1), where ∆ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sociology International Journal
سال: 2019
ISSN: 2576-4470
DOI: 10.15406/sij.2019.03.00159